Decidability Results for Metric and Layered Temporal Logics

نویسندگان

  • Angelo Montanari
  • Alberto Policriti
چکیده

We study the decidability problem for metric and layered temporal logics. The logics we consider are suitable to model time granularity in various contexts, and they allow one to build granular temporal models by referring to thènatural scale' in any component of the model and by properly constraining the interactions between diierently-grained components. A monadic second-order language combining operators such as temporal contextualization and projection, together with the usual displacement operator of metric temporal logics, is considered, and the theory of nitely-layered metric temporal structures is shown to be decidable.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decidable theories of !-layered metric temporal structures

This paper focuses on decidability problems for metric and layered temporal logics which allow one to model time granularity in various contexts. The decidability of pure metric (non-granular) fragments and of metric temporal logics endowed with nitely many layers has been already proved by reduction to the decidability problem of the well-known theory S1S. In the present work, we prove the dec...

متن کامل

A decidable theory of nitely-layered metric temporal structures

We study the decidability problem for metric and layered temporal logics. The logics we consider are suitable to model time granularity in various contexts, and they allow one to build granular temporal models by referring to thènatural scale' in any component of the model and by properly constraining the interactions between diierently-grained components. A monadic second-order language combin...

متن کامل

Theories of ! - Layered MetricTemporal

This paper focuses on decidability problems for metric and layered temporal logics. The considered logics|suitable to model time granularity in various contexts|allow one to build granular temporal models by referring to the natural scale in any component of the model and properly constraining the interactions between diierently grained components. We prove the decidability of both the theory o...

متن کامل

Metric and Layered Temporal Logic for Time Granularity

This dissertation is about the design of temporal logics that deal with changing timegranularities. Time granularity can be de ned as the resolution power of the temporalquali cation of a statement. Providing a formalism with the concept of time granularitymakes it possible to specify time information with respect to di erently-grained temporaldomains. This does not merely m...

متن کامل

On the Decidability and Complexity of Some Fragments of Metric Temporal Logic

Metric Temporal Logic, MTL[UI , SI ], is amongst the most studied real-time logics. It exhibits considerable diversity in expressiveness and decidability properties based on the permitted set of modalities and the nature of time interval constraints I . In this paper, we sharpen the decidability results by showing that the satisfiability of MTL [ UI , SNS] (where NS denotes non-singular interva...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Notre Dame Journal of Formal Logic

دوره 37  شماره 

صفحات  -

تاریخ انتشار 1996